Hypergraphs and proper forcing
نویسنده
چکیده
Given a Polish space X and a countable collection of analytic hypergraphs on X, I consider the σ-ideal generated by Borel anticliques for the hypergraphs in the family. It turns out that many of the quotient posets are proper. I investigate the forcing properties of these posets, certain natural operations on them, and prove some related dichotomies.
منابع مشابه
The 1-2-3 Conjecture for Uniform Hypergraphs
Given an r-uniform hypergraph H = (V,E) and a weight function ω : E → {1, . . . , w}, a coloring of vertices of H, induced by ω, is defined by c(v) = ∑ e3v w(e) for all v ∈ V . In this paper, we show that for almost all 3-uniform hypergraphs there exists a weighting of the edges from {1, 2} that induces a proper vertex-coloring (that means with no monochromatic edges). For r ≥ 4, we show that a...
متن کاملProper forcing extensions and Solovay models
We study the preservation of the property of L(R) being a Solovay model under proper projective forcing extensions. We show that every ∼ 1 3 strongly-proper forcing notion preserves this property. This yields that the consistency strength of the absoluteness of L(R) under ∼ 1 3 strongly-proper forcing notions is that of the existence of an inaccessible cardinal. Further, the absoluteness of L(R...
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملProper forcing, cardinal arithmetic, and uncountable linear orders
In this paper I will communicate some new consequences of the Proper Forcing Axiom. First, the Bounded Proper Forcing Axiom implies that there is a well ordering of R which is Σ1-definable in (H(ω2),∈). Second, the Proper Forcing Axiom implies that the class of uncountable linear orders has a five element basis. The elements are X, ω1, ω∗ 1 , C, C ∗ where X is any suborder of the reals of size ...
متن کاملColor-bounded hypergraphs, V: host graphs and subdivisions
A color-bounded hypergraph is a hypergraph (set system) with vertex set X and edge set E = {E1, . . . , Em}, together with integers si and ti satisfying 1 ≤ si ≤ ti ≤ |Ei| for each i = 1, . . . ,m. A vertex coloring φ is proper if for every i, the number of colors occurring in edge Ei satisfies si ≤ |φ(Ei)| ≤ ti. The hypergraph H is colorable if it admits at least one proper coloring. We consid...
متن کامل